Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
نویسندگان
چکیده
In this paper, we consider some practical applications of the symbolic Hamburger-Noether expressions for plane curves, which are introduced as a symbolic version of the so-called Hamburger-Noether expansions. More precisely, we give and develop in symbolic terms algorithms to compute the resolution tree of a plane curve (and the adjunction divisor, in particular), rational parametrizations for the branches of such a curve, special adjoints with assigned conditions (connected with different problems, like the so-called Brill-Noether algorithm), and the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. Some other computational problems related to algebraic curves over perfect fields can be treated symbolically by means of such expressions, but we deal just with those connected with the effective construction and decoding of algebraic geometry codes.
منابع مشابه
Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes
We present an algorithm to compute bases for the spaces L(G) and Ω(G), provided G is a rational divisor over a non-singular absolutely irreducible algebraic curve, and also another algorithm to compute the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. The method is founded on the Bril...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملEvaluation codes and plane valuations
We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions given by valuations of 2-dimensional function fields. We show that these order functions are simple when their ordered domains are isomorphic to the value semigroup algebra of the corresponding valuation. Otherwise, we provide...
متن کاملAG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
We investigate several types of linear codes constructed from two families S̃q and R̃q of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such curves are provided, and the Weierstrass semigroup H(P ) at an Fq-rational point P is shown to be symmetric.
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002